Graph connectivity - PDFSEARCH.IO - Document Search Engine

Graph connectivity
Results: 1040

#	Item
921	On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-05-19 08:04:24 NP-complete problems Graph coloring Search algorithms Connectivity Unit disk graph Nearest neighbor search Distributed computing Connected component Dominating set Theoretical computer science Graph theory Mathematics
922	CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:56:24 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
923	Unit Disk Graph Approximation∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-11 12:11:55 Graph Connectivity Topology Graph coloring Petersen graph Planar separator theorem Graph theory NP-complete problems Unit disk graph
924	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-24 07:43:23 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Topology Unit disk graph Graph coloring Breadth-first search Graph theory Theoretical computer science Mathematics
925	Virtual Coordinates for Ad Hoc and Sensor Networks Thomas Moscibroda Regina O‘Dell Mirjam Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-10-11 04:26:00 Wireless sensor network ETH Zurich Connectivity Switzerland Wireless networking NP-complete problems Unit disk graph
926	CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics
927	Bounds for cell entries in contingency tables given marginal totals and decomposable graphs Adrian Dobra and Stephen E. Fienberg* Department of Statistics and Center for Automated Learning and Discovery, Carnegie Mellon Add to Reading List Source URL: lib.stat.cmu.edu Language: English - Date: 2000-10-25 12:01:29 Clique Tree decomposition Vertex separator Connectivity Graph NP-complete problems Path decomposition Planar separator theorem Graph theory Graph operations Chordal graph
928	Recognizing and characterizing visibility graphs of simple polygons Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2010-03-10 01:30:23 Visibility graph Hamiltonian path Cycle Path Graph Planar graphs Petersen graph Cycle graph Graph theory Graph connectivity Robot control
929	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-03-01 02:05:39 Network theory Shortest path problem Randomized algorithm Connectivity Graph theory Networks Theoretical computer science Mathematics Computational complexity theory
930	CS 170 Fall 2006 — Discussion Handout #7 November 16, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-11-16 17:09:00 Network flow NP-complete problems Combinatorial optimization Maximum flow problem Flow network Vertex cover Matching Bipartite graph Connectivity Graph theory Mathematics Theoretical computer science

UPDATE